Domain Decomposition for Less Regular Subdomains: Overlapping Schwarz in Two Dimensions
نویسندگان
چکیده
In the theory of domain decomposition methods, it is often assumed that each subdomain is the union of a small set of coarse triangles or tetrahedra. In this study, extensions to the existing theory which accommodate subdomains with much less regular shapes are presented; the subdomains are required only to be John domains. Attention is focused on overlapping Schwarz preconditioners for problems in two dimensions with a coarse space component of the preconditioner, which allows for good results even for coefficients which vary considerably. It is shown that the condition number of the domain decomposition method is bounded by C(1 +H/δ)(1 + log(H/h))2, where the constant C is independent of the number of subdomains and possible jumps in coefficients between subdomains. Numerical examples are provided which confirm the theory and demonstrate very good performance of the method for a variety of subregions including those obtained when a mesh partitioner is used for the domain decomposition.
منابع مشابه
An Overlapping Schwarz Algorithm for Raviart-Thomas Vector Fields with Discontinuous Coefficients
Overlapping Schwarz methods form one of two major families of domain decomposition methods. We consider a two-level overlapping Schwarz method for Raviart-Thomas vector fields. The coarse part of the preconditioner is based on the energy-minimizing extensions and the local parts are based on traditional solvers on overlapping subdomains. We show that the condition number grows linearly with the...
متن کاملA Two-level Overlapping Schwarz Method for H(curl) in Two Dimensions with Irregular Subdomains
A bound is obtained for the condition number of a two-level overlapping Schwarz algorithm for problems posed in H(curl) in two dimensions, where the subdomains are only assumed to be uniform in the sense of Peter Jones. The coarse space is based on energy minimization and its dimension equals the number of interior subdomain edges. Local direct solvers are used on the overlapping subdomains. Ou...
متن کاملOn the Design of Small Coarse Spaces for Domain Decomposition Algorithms
Methods are presented for automatically constructing coarse spaces of low dimension for domain decomposition algorithms. These constructions use equivalence classes of nodes on the interface between the subdomains into which the domain of a given elliptic problem has been subdivided, e.g., by a mesh partitioner such as METIS; these equivalence classes already play a central role in the design, ...
متن کاملOverlapping Schwarz Preconditioners for Spectral Nédélec Elements for a Model Problem in H(curl)
A two-level overlapping domain decomposition method is analyzed for a Nédélec spectral element approximation of a model problem appearing in the solution of Maxwell’s equations. The overlap between subdomains can consist of entire spectral elements or rectangular subsets of spectral elements. For fixed relative overlap and overlap made from entire elements, the condition number of the method is...
متن کاملNumerische Mathematik Manuscript-nr. Overlapping Schwarz Methods on Unstructured Meshes Using Non-matching Coarse Grids
We consider two level overlapping Schwarz domain decomposition methods for solving the nite element problems that arise from discretizations of elliptic problems on general unstructured meshes in two and three dimensions. Standard nite element interpolation from the coarse to the ne grid may be used. Our theory requires no assumption on the substructures that constitute the whole domain, so the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Numerical Analysis
دوره 46 شماره
صفحات -
تاریخ انتشار 2008